Apparatus for processing digital image and method therefor

ABSTRACT

An apparatus which processes a digital image and a method therefor which can reduce an error when calculating an output value obtained by interpolating pixel values of the input digital image. The apparatus includes an interpolation processing unit which interpolates an input digital image, and a controller which measures an interpolation interval of pixel values of the digital image, calculates a coefficient by substituting the interpolation interval for a coefficient equation stored in a register, and calculates an interpolation node for the digital image by substituting the coefficient and an output pixel position value of the digital image for an interpolation node calculation equation. The controller controls the interpolation processing unit so as to interpolate the digital image to the interpolation node. As a result, it is possible to reduce an error between an interpolated output pixel position value and an output pixel position value for the pixel values of the input digital image.

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application claims the benefit of Korean Patent Application No.2001-56935 filed on Sep. 14, 2001, in the Korean Industrial Property Office, the disclosure of which is incorporated herein by reference.

BACKGROUND OF THE INVENTION

[0002] 1. Field of the Invention

[0003] The present invention relates to an apparatus which processes a digital image and a method therefor, and more particularly, to an apparatus which processes a digital image and a method therefor which can enlarge or reduce the digital image photographed by an image collecting apparatus such as a digital camera.

[0004] 2. Description of the Related Art

[0005]FIG. 1 shows a conventional apparatus which processes a digital image. For example, digital image pixel data is input from a frame store memory (not shown) to the apparatus for digital image processing. The input digital image pixel data is interpolated by the apparatus, which processes the digital image, and output through a printer (not shown) or stored in another frame store memory (not shown) for a later processing.

[0006] The conventional apparatus which processes the digital image includes a controller 100, a vertical direction interpolation coefficient memory 101, a vertical direction interpolation input buffer 103, a vertical direction interpolation circuit 105, a vertical direction interpolation output buffer 107, a horizontal direction interpolation circuit 109, and a horizontal direction interpolation coefficient memory 111.

[0007] The controller 100 controls the vertical direction interpolation coefficient memory 101, the vertical direction interpolation input buffer 103, the vertical direction interpolation circuit 105, the vertical direction interpolation output buffer 107, the horizontal direction interpolation circuit 109, and the horizontal direction interpolation coefficient memory 111, so as to interpolate pixel values of the input digital image.

[0008] The vertical direction interpolation input buffer 103 temporarily stores the pixel values of the input digital image, and is embodied in a First-In First-Out (FIFO). Here, the FIFO is a method of processing program operation requests which processes a first request first (i.e., a firstly-input pixel value of the digital image).

[0009] At least one interpolation coefficient which creates an equation that represents a position of an output pixel, which is an interpolation node, is stored in the vertical direction interpolation coefficient memory 101 and the horizontal direction interpolation coefficient memory 111. The interpolation coefficients of the respective output pixel positions are calculated according to a distance between the pixel values of the input digital image, an increment interval between the pixel positions of the output digital image, and an interpolation method in the respective output pixel positions. In addition, a series of the pixel values of the input digital image are multiplied by the corresponding interpolation coefficients, thereby interpolating the pixel values of the input digital image.

[0010] When receiving a vertical direction interpolation processing signal by the controller 100, the vertical direction interpolation circuit 105 obtains vertical direction interpolation coefficients corresponding to the pixel values of the input digital image from the vertical direction interpolation coefficient memory 101, respectively multiplies the pixel values of the digital image by the vertical direction interpolation coefficients corresponding to the pixel values, and calculates a sum of the resulting values to perform the vertical direction interpolation. The pixel values of the digital image interpolated in a vertical direction by the vertical direction interpolation circuit 105 are stored in the vertical direction interpolation output buffer 107.

[0011] The horizontal direction interpolation circuit 109 receives the pixel values of the digital image interpolated in a vertical direction from the vertical direction interpolation output buffer 107. In addition, the horizontal direction interpolation circuit 109 obtains horizontal direction interpolation coefficients corresponding to the pixel values of the input digital image from the horizontal direction interpolation coefficient memory 111. Thereafter, the horizontal direction interpolation circuit 109 respectively multiplies the pixel values of the digital image interpolated in the vertical direction by the horizontal direction interpolation coefficients obtained from the horizontal direction interpolation coefficient memory 111, and calculates a sum of the resulting values to perform the horizontal direction interpolation. Accordingly, the horizontal and vertical direction interpolations of the pixel values of the input digital image are completed.

[0012] A variety of filters, such as bilinear, spline and cubic filters, which enlarge or reduce the digital image, are required to interpolate the digital image. Enlargement or reduction of the digital image by the filters should satisfy ideal filter properties. However, it is impossible to embody such an ideal filter. In FIG. 1, a sync function type filter is used, and a cubic convolution of FIG. 1 uses a shape shown in FIG. 2.

[0013] The convolution of FIG. 2 is represented by Formula 1: $\begin{matrix} {{R_{c}(x)} = \begin{pmatrix} \left. \left( {a + 2} \right) \middle| x \middle| {}_{3}{- \left( {a + 3} \right)} \middle| x \middle| {}_{2}{{{+ 1}\quad \ldots \quad 0} \leq} \middle| x \middle| {\leq 1} \right. \\ \left. a \middle| x \middle| {}_{3}{{- 5}a} \middle| x \middle| {}_{2}{{+ 8}a} \middle| x \middle| {{{- 4}a\quad \ldots \quad 1} \leq} \middle| x \middle| {\leq 2} \right. \end{pmatrix}} & {< {{Formula}\quad 1} >} \end{matrix}$

[0014] wherein, when ‘a=−½’ is satisfied, Formula 1 is represented by Formula 2: $\begin{matrix} {{u(x)} = \left\{ \begin{matrix} {\quad \left. \frac{3}{2} \middle| x \middle| {}_{3}{- \frac{5}{2}} \middle| x \middle| {}_{2}{{{+ 1}\quad \ldots \quad 0} <} \middle| x \middle| {< 1} \right.} \\ {\quad \left. {- \frac{1}{2}} \middle| x \middle| {}_{3}{+ \frac{5}{2}} \middle| x \middle| {}_{2}{- 4} \middle| x \middle| {{{+ 2}\quad \ldots \quad 1} <} \middle| x \middle| {< 2} \right.} \\ {\quad \left. {{0\quad \ldots \quad 2} <} \middle| x \right|} \end{matrix} \right.} & {< {{Formula}\quad 2} >} \end{matrix}$

[0015]FIG. 3 illustrates an interpolation method by the cubic convolution of FIG. 2. Assuming that an interval of the respective periods is ‘1’, an interpolation node Y_(p) is represented by Formula 3 according to a boundary condition: $\begin{matrix} {Y_{p} = \left\{ {\begin{matrix} {{\left\lbrack {{{- \frac{1}{2}}\left( {1 + t} \right)^{2}} + {\frac{5}{2}\left( {1 + t} \right)^{2}} - {4\left( {1 + t} \right)} + 2} \right\rbrack Y_{k - 1}} +} \\ {{\left\lbrack {{\frac{3}{2}(t)^{3}} - {\frac{5}{2}t^{2}} + 1} \right\rbrack Y_{k}} +} \\ {{\left\lbrack {{\frac{3}{2}\left( {1 - t} \right)^{3}} - {\frac{5}{2}\left( {1 - t^{2}} \right)} + 1} \right\rbrack Y_{k + 1}} +} \\ {\left\lbrack {{{- \frac{1}{2}}\left( {2 - t} \right)^{3}} + {\frac{5}{2}\left( {2 - t} \right)^{2}} - {4\left( {2 - t} \right)} + 2} \right\rbrack Y_{k + 2}} \end{matrix}\quad} \right.} & {< {{Formula}\quad 3} >} \end{matrix}$

[0016] Formula 4 is obtained by processing Formula 3 as a function of ‘t’. Here, Y_(k−1), Y_(k), Y_(k+1) and Y_(k+2) indicate positions of k−1, k, k+1 and k+2-th sampled output pixels of the input digital image, respectively. $\begin{matrix} {\begin{matrix} {Y_{p} = \quad {{\left\{ {\left( {Y_{k + 2} - {3Y_{k + 1}} + {3Y_{k}} - Y_{k - 1}} \right)/2} \right\} t^{3}} +}} \\ {\quad {{\left\{ {\left( {{- Y_{k + 2}} + {4Y_{k + 1}} - {5Y_{k}} + {2Y_{k - 1}}} \right)/2} \right\} t^{2}} +}} \\ {\quad {{\left\{ {\left( {Y_{k + 2} - {2Y_{k - 1}}} \right)/2} \right\} t} + Y_{k}}} \end{matrix}\quad} & {< {{Formula}\quad 4} >} \end{matrix}$

[0017] Formula 5 is obtained by processing Formula 4:

[0018] <Formula 5>

Y _(p) =C ₁Y_(k−1) +C ₂ Y _(k) +C ₃ Y _(k+1) +C ₄ Y _(k+2)

C ₁=(−t³+2t²−t)/2

C ₂=(3t ³−5t ²+2)/2

C ₃=(−3t ³+4t ² +t)/2

C ₄=(t ³ −t ²)/2

[0019] Here, the respective coefficients C₁, C₂, C₃ and C₄ can use a lookup table.

[0020] However, when the apparatus is embodied in a form of hardware, in a scaler such as the cubic convolution, it takes a long processing time to apply the above Formula(s) to each scale value. In addition, as shown in FIG. 4, a lot of adders and multipliers are required to express the respective interpolation coefficients in the form of hardware. Thus, a bank is generally used as shown in FIG. 5. Here, the bank is a logical unit which divides a main memory device for management. The bank is used to prepare for an increase of the main memory device or to utilize a limited memory device space by bank switching. The more banks are used, the higher the performance. Although a small number of adders and multipliers are required when the banks are used, rather than the use of the Formula(s), so far as the memory is not infinite, the bank obtains approximate values. Accordingly, such an error influences the overall image quality. Moreover, buses are more frequently used due to memory access.

[0021] That is, in the cubic convolution using N banks, the respective banks are used with a representative value, thus generating an error. For example, when values between 0 and 1 are divided by five banks, the values are divided at an interval of 0.2. When Y_(p) exists between 0 and 0.2, a distance ‘t’ between 0 and 1 in the cubic convolution filter is set up to be 0.1, to calculate the values C₁, C₂, C₃ and C₄. Accordingly, values between 0 and 0.2 are approximated to 0.1, which may generate an error. FIGS. 6A, 6B, 6C and 6D illustrate an error distribution of the cubic convolution of FIG. 3 and probable errors of the respective coefficients.

[0022] Referring to FIGS. 6A to 6D, the coefficients are divided by 1/N periods during N bank periods, and an error value of each period is reduced due to an increase of N. In addition, when the coefficients having errors are respectively multiplied by the pixel values, the interpolated pixel values have bigger errors. For example, assuming that ‘t’ is 0.19 and the pixel value of the digital image represented by (255 255 1 1) belongs to a first bank, the representative value of ‘t’ becomes 0.1, and thus the interpolated pixel value becomes 283. However, since ‘t’ is 0.19, the interpolated pixel value calculated by using the actual ‘t’ is 216. Accordingly, an error value of 67 is generated between the pixel value interpolated by the representative value of ‘t’ of the bank and the pixel value interpolated by the actual ‘t’.

[0023]FIG. 7 shows a flowchart illustrating a conventional method of processing a digital image. As shown in FIG. 7 with reference to FIG. 1, the controller 100 calculates a size ratio of the pixel value of the input digital image to an aimed pixel value to be interpolated by the vertical direction interpolation circuit 105 and the horizontal direction interpolation circuit 109 in operation 1001. That is, when the horizontal direction is X and the vertical direction is Y, X scale is X size of the original digital image/X size of the aimed digital image, and Y scale is Y size of the original digital image/Y size of the aimed digital image.

[0024] After calculating X and Y scales, the controller 100 measures Y_(k−1), Y_(k), Y_(k+1) and Y_(k+2) in operation 1003. Here, Y_(k−1), Y_(k), Y_(k+1) and Y_(k+2) indicate positions of the k−1, k, k+1 and k+2-th sampled output pixels of the input digital image, respectively. After measuring Y_(k−1), Y_(k), Y_(k+1) and Y_(k+2), the controller 100 obtains ‘t’ from the scale size in operation 1005. Here, ‘t’ represents an X axis interval between the pixel value of the input digital image and the interpolation node, namely an interpolation interval. After calculating ‘t’, the controller 100 obtains coefficients from the corresponding memories, the vertical direction interpolation coefficient memory 101 and the horizontal direction interpolation coefficient memory 111 according to ‘t’ in operation 1007. As described above, the vertical direction interpolation coefficient memory 101 and the horizontal direction interpolation coefficient memory 111 store the coefficients for variables which indicate the positions of the output pixels sampled in the interpolation node calculation equation.

[0025] The controller 100 calculates the interpolation node Yp according to the obtained coefficient in operation 1009. In addition, the controller 100 interpolates the input digital image by using the calculated interpolation node in operation 1011. Accordingly, interpolation of the input digital image is completed.

[0026] However, the conventional apparatus which processes the digital image and the method therefor require many adders and multipliers in a form of hardware, and also require many banks to obtain precise values. Moreover, when a number of the banks is restricted, the respective banks store the representative values of the interpolation intervals. As a result, an error is generated between the pixel value by the actual interpolation interval ‘t’ and the pixel value by the representative value thereof.

SUMMARY OF THE INVENTION

[0027] Accordingly, it is an object of the present invention to provide an apparatus which processes a digital image and a method therefor which can decrease a processing time by reducing memory access in a cubic convolution filter, and prevent an error between a pixel value by an actual interpolation interval ‘t’ and an interpolated pixel value.

[0028] Additional objects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.

[0029] To achieve the above and other objects of the present invention, there is provided an apparatus which processes a digital image, comprising an interpolation processing unit which interpolates an input digital image, and a controller which measures an interpolation interval of pixel values of the digital image, calculates a coefficient by substituting the measured interpolation interval for a coefficient equation stored in a register, and calculates an interpolation node for the digital image by substituting the coefficient and an output pixel position value of the digital image for an interpolation node calculation equation, wherein the controller controls the interpolation processing unit so as to interpolate the digital image to the interpolation node.

[0030] According to an aspect of the present invention, the coefficient equation is represented by and satisfies the following relationship:

C _(n)(t)=a _(kn) t+b _(kn)

[0031] where C_(n) denotes the coefficient of a variable of a position of an output pixel indicating an n-th input digital image in an equation representing the position of the output pixel which is the interpolation node, t denotes the interpolation interval, a_(kn) is stored in a k-th register and represents a gradient of a straight line passing a position of an output pixel of an n-1th input digital image and the position of the output pixel of the n-th input digital image with respect to a predetermined interpolation interval, b_(kn) is stored in the k-th register and represents an intersecting point between the straight line passing the position of the output pixel of the n-1th input digital image and the position of the output pixel of the n-th input digital image with respect to the predetermined interpolation interval and Y axis, and ‘k=1, 2, 3, . . . , k, . . . ’ and ‘n=2, 3, 4, . . . , n, . . . .’

[0032] According to another aspect of the present invention, the interpolation node calculation equation is represented by and satisfies the following relationship:

Y _(p) =Y _(n−1) C _(n+1) +Y _(n) C _(n) +Y _(n+1) C _(n+1) +Y _(n+2) C _(n+2)

[0033] where Y_(p) denotes the interpolation node of the input digital image, Y_(n) denotes a position of an n-th sampled output pixel of the input digital image, C_(n) is the coefficient of the position of the n-th sampled output pixel of the input digital image, and ‘n=2, 3, 4, . . . , n, . . . .’

[0034] To achieve the above and other objects of the present invention, there is provided a method of processing a digital image, the method comprising measuring an interpolation interval of pixel values of an input digital image, calculating a coefficient by substituting the interpolation interval for a coefficient equation stored in a register, calculating an interpolation node for the digital image by substituting the coefficient and an output pixel position value of the digital image on an interpolation node calculation equation, and controlling an interpolation processing unit so as to interpolate the digital image to the interpolation node.

[0035] Accordingly, it is not necessary to use a large number of adders and multipliers in the present invention. Furthermore, the processing time of the controller of the present apparatus can be decreased by reducing the access time of the memory.

BRIEF DESCRIPTION OF THE DRAWINGS

[0036] These and other objects and advantages of the present invention will become apparent and more readily appreciated from the following description of the embodiments, taken in conjunction with the attached drawings in which:

[0037]FIG. 1 is a schematic block diagram illustrating a conventional apparatus which processes a digital image;

[0038]FIG. 2 is a graph illustrating waveforms of a cubic convolution of the apparatus shown in FIG. 1;

[0039]FIG. 3 is a graph explaining an interpolation method by the cubic convolution of FIG. 2;

[0040]FIG. 4 is a diagram illustrating an example where one of the coefficients for an equation representing a position of an output pixel in the graph of FIG. 3 is embodied as adders and multipliers;

[0041]FIG. 5 is a diagram illustrating an example where the coefficient of the cubic convolution of FIG. 3 is embodied as banks;

[0042]FIGS. 6A, 6B, 6C and 6D are diagrams illustrating an error distribution of the cubic convolution of FIG. 3;

[0043]FIG. 7 is a flowchart illustrating a conventional method of processing a digital image;

[0044]FIG. 8 is a schematic block diagram illustrating an apparatus which processes a digital image according to an embodiment of the present invention;

[0045]FIGS. 9A, 9B, 9C and 9D are diagrams illustrating linearity of errors where a coefficient of a cubic convolution of the apparatus shown in FIG. 7 is embodied as banks; and

[0046]FIG. 10 is a flowchart illustrating a method of processing a digital image according to another embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0047] Reference will now be made in detail to the embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to the like elements throughout. The embodiments are described below in order to explain the present invention by referring to the figures.

[0048]FIG. 8 shows an apparatus which processes a digital image according to an embodiment of the present invention. The apparatus includes a controller 200, a horizontal direction interpolation input buffer 203, a horizontal direction interpolation circuit 205, a horizontal direction interpolation output buffer 207, and a vertical direction interpolation circuit 209. The controller 200 includes a register 200 a.

[0049] The controller 200 controls the horizontal direction interpolation input buffer 203, the horizontal direction interpolation circuit 205, the horizontal direction interpolation output buffer 207, and the vertical direction interpolation circuit 209, so as to interpolate pixel values of the input digital image. In addition, the controller 200 measures an interpolation interval (t) for the pixel values of the input digital image, and performs operations for interpolating the digital image by using the measured interpolation interval.

[0050] Since the horizontal direction interpolation input buffer 203, the horizontal direction interpolation circuit 205, the horizontal direction interpolation output buffer 207, and the vertical direction interpolation circuit 209 have a similar function as those shown in FIG. 1, explanations thereof are omitted to avoid repetition. However, the respective elements 203, 205, 207 and 209 have different processing procedures.

[0051] The register 200 a is installed in the controller 200, and stores a coefficient equation. As illustrated in FIGS. 9A, 9B, 9C and 9D, the coefficient equation uses a relationship that errors have linearity when coefficients of a cubic convolution are embodied as banks. Here, FIGS. 9A through 9D are graphs showing C₁, C₂, C₃ and C₄, respectively.

[0052] That is, when a period for an X scale is divided by N banks, the period is divided into N periods. A range of the errors in the respective N periods is linear. When N is increased, the range of the errors has high linearity. As shown in FIGS. 9A through 9D, the errors of each period are represented by linear equations. A slight difference may be generated from the actual value due to linear expression as in the second period of C₁ and the fourth period of C₄. However, values of C₁ and C₄ are smaller than those of C₂ and C₃, and thus can be ignored. Moreover, the values of C₁ or C₄ have high linearity due to an increase of N.

[0053] When a number of the banks is N, linear equations as many as N*sampling number for the pixel values of the input digital image may be required. When the bank for the interpolation is determined, coefficients approximate to cubic convolution waveforms in the respective banks can be obtained by using the linear equations. That is, the linear equation is represented by ‘aX+b’. Here, ‘a’ denotes a gradient and ‘b’ denotes an Y intercept. X is decided by the scale size. Thus, X has a value less than 1 in interpolation, and greater than 1 in decimation. Since the bank can be informed by using the interpolation interval (t) decided by the scale size, the error value can be reduced to a minimum value by using the previously-decided linear equation of the bank.

[0054] The above coefficient equation satisfies and is represented by Formula 7:

[0055] <Formula 7>

C _(n)(t)=a _(kn) t+b _(kn)

[0056] where C_(n) denotes the coefficient of a variable of a position of an output pixel indicating an n-th input digital image in an equation representing the position of the output pixel which is the interpolation node, t denotes the interpolation interval, a_(kn) is stored in a k-th register and represents a gradient of a straight line passing a position of an output pixel of an n-1th input digital image and the position of the output pixel of the n-th input digital image with respect to a predetermined interpolation interval, b_(kn) is stored in the k-th register and represents an intersecting point between the straight line passing the position of the output pixel of the n-1th input digital image and the position of the output pixel of the n-th input digital image with respect to the predetermined interpolation interval and Y axis, and ‘k=1, 2, 3, . . . , k, . . . ’ and ‘n=2, 3, 4, . . . , n, . . . .’

[0057]FIG. 10 shows a flowchart illustrating a method of processing the digital image according to the present invention. The operation of the apparatus as shown in FIG. 8 of the present invention will now be explained in detail with reference to FIG. 10.

[0058] The controller 200 calculates a size ratio of the pixel value of the input digital image to an aimed pixel value to be interpolated by the horizontal direction interpolation circuit 205 and the vertical direction interpolation circuit 209 in operation 2001. That is, when the horizontal direction is X and the vertical direction is Y, X scale is X size of the original digital image/X size of the aimed digital image, and Y scale is Y size of the original digital image/Y size of the aimed digital image.

[0059] After calculating X and Y scales, the controller 200 measures Y_(k−1), Y_(k), Y_(k+1) and Y_(k+2) in operation 2003. Here, Y_(k−1), Y_(k), Y_(k+1) and Y_(k+2) indicate positions of the k-1, k, k+1 and k+2-th sampled output pixels of the input digital image, respectively. After measuring Y_(k−1), Y_(k), Y_(k+1) and Y_(k+2), the controller 200 obtains ‘t’ from the scale size in operation 2005. Here, ‘t’ represents an X axis interval between the pixel value of the input digital image and the interpolation node, namely an interpolation interval. After calculating ‘t’, the controller 200 obtains a corresponding coefficient equation from the register 200 a according to ‘t’ in operation 2007. As described above, the register 200 a stores the coefficient equations for each coefficient in the interpolation node calculation equation, and is provided in the controller 200. The amount of information stored in the register 200 a corresponds to the predetermined coefficient equations, thereby reducing a processing time of the controller 200.

[0060] The controller 200 calculates the coefficient from the coefficient equation in operation 2009, and obtains the interpolation node Yp by using the obtained coefficient in operation 2011. That is, the controller 200 transmits an interpolation node calculation signal to the horizontal direction interpolation circuit 205 and the vertical direction interpolation circuit 209, multiplies the coefficients from the register 200 a by the pixel values of the inputted digital image, respectively, and calculates a sum of the resulting values, thereby performing the horizontal and vertical direction interpolations in operation 2013. The interpolation node calculation equation satisfies and is represented by Formula 8:

[0061] <Formula 8>

Y _(p) =Y _(n−1) C _(n−1) +Y _(n) C _(n) +Y _(n+1) C _(n+1) Y _(n+2) N _(n+2)

[0062] where Y_(p) denotes the interpolation node of the input digital image, Y_(n) denotes a position of an n-th sampled output pixel of the input digital image, C_(n) is the coefficient of the position of the n-th sampled output pixel of the input digital image, and ‘n=2, 3, 4, . . . , n, . . . .’

[0063] The controller 200 interpolates the input digital image by using the calculated interpolation node in operation 2130. Accordingly, interpolation of the pixel values of the input digital image is completed.

[0064] The coefficient equation is represented by a linear equation according to the relationship that the range of the errors by N banks has linearity, thereby reducing the error of the interpolated value of the pixel value of the input digital image. In addition, when the present apparatus is embodied in a form of hardware, a large number of adders and multipliers is not needed, further simplifying the structure of the digital image processing apparatus. In the method of calculating the coefficient from the register 200 a, storing the coefficient equation and obtaining the interpolation node, the coefficient equation is stored in the register 200 a of the controller 200 to reduce the processing time of the controller 200.

[0065] Although a few embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes may be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents. 

What is claimed is:
 1. An apparatus for processing a digital image, comprising: a register which stores a coefficient equation; an interpolation processing unit which interpolates the input digital image; and a controller which: measures an interpolation interval of pixel values of the digital image, calculates a coefficient by substituting the interpolation interval for the coefficient equation stored in the register, calculates an interpolation node for the digital image by substituting the coefficient, and an output pixel position value of the digital image for an interpolation node calculation equation, and controls the interpolation processing unit to interpolate the digital image to the interpolation node.
 2. The apparatus of claim 1, wherein the coefficient equation satisfies the following relationship: C _(n)(t)=a_(kn) t+b _(kn) where C_(n) denotes the coefficient of a variable of a position of an output pixel indicating an n-th input digital image in an equation representing the position of the output pixel which is the interpolation node, t denotes the interpolation interval, a_(kn) is stored in a k-th register and represents a gradient of a straight line passing a position of an output pixel of an n-1th input digital image and the position of the output pixel of the n-th input digital image with respect to a predetermined interpolation interval, b_(kn) is stored in the k-th register and represents an intersecting point between the straight line passing the position of the output pixel of the n-1th input digital image and the position of the output pixel of the n-th input digital image with respect to the predetermined interpolation interval and Y axis, and ‘k=1, 2, 3, . . . , k, . . . ’ and ‘n=2, 3, 4, . . . ,n . . . .’
 3. The apparatus of claim 2, wherein the interpolation node calculation equation satisfies the following relationship: Y _(p) =Y _(n−1) C _(n−1) +Y _(n) C _(n) +Y _(n+1) C _(n+1) Y _(n+2) C _(n+2) where Y_(p) denotes the interpolation node of the input digital image, Y_(n) denotes a position of an n-th sampled output pixel of the input digital image, and C_(n) is the coefficient of the position of the n-th sampled output pixel of the input digital image.
 4. A method of processing a digital image, the method comprising: measuring an interpolation interval of pixel values of the input digital image; calculating a coefficient by substituting the interpolation interval for a coefficient equation stored in a register; calculating an interpolation node for the digital image by substituting the coefficient and an output pixel position value of the digital image for an interpolation node calculation equation; and controlling an interpolation processing unit to interpolate the digital image to the interpolation node.
 5. The method of claim 4, wherein the coefficient equation satisfies the following relationship: C _(n)(t)=a _(kn) t+b _(kn) where C_(n) denotes the coefficient of a variable of a position of an output pixel indicating an n-th input digital image in an equation representing the position of the output pixel which is the interpolation node, t denotes the interpolation interval, a_(kn) is stored in a k-th register and represents a gradient of a straight line passing a position of an output pixel of an n-1th input digital image and the position of the output pixel of the n-th input digital image with respect to a predetermined interpolation interval, b_(kn) is stored in the k-th register and represents an intersecting point between the straight line passing the position of the output pixel of the n-1th input digital image and the position of the output pixel of the n-th input digital image with respect to the predetermined interpolation interval and Y axis, and ‘k=1, 2, 3, . . . , k, . . . ’ and ‘n=2, 3, 4, . . . , n, . . . .’
 6. The method of claim 5, wherein the interpolation node calculation equation satisfies the following relationship: Y _(p) =Y _(n−1) C _(n−1) +Y _(n) C _(n) +Y _(n+1) C _(n+1) +Y _(n+2) C _(n+2) where Y_(p) denotes the interpolation node of the input digital image, Y_(n) denotes a position of an n-th sampled output pixel of the input digital image, and C_(n) is the coefficient of the position of the n-th sampled output pixel of the input digital image.
 7. The method of claim 6, wherein the coefficient equation is stored in the register and has linearity so as to reduce a processing time of the digital image and prevent errors in the interpolated digital image.
 8. The method of claim 4, wherein the measuring of the interpolation interval comprises: calculating a size ratio of the pixel values of the input digital image to aimed pixel values; measuring positions of sampled output pixels of the input digital image; and obtaining the interpolation interval according to the size ratio and the positions of the sampled output pixels.
 9. The method of claim 8, further comprising selecting the coefficient equation according to the interpolation interval among stored coefficient equations in the register for each coefficient in the interpolation node calculation equation.
 10. The method of claim 9, wherein the coefficient equation is stored in the register and has linearity so as to reduce a processing time of the digital image and prevent errors in the interpolated digital image.
 11. The apparatus of claim 1, further comprising: a horizontal direction interpolation input buffer which stores the pixel values of the input digital image; a horizontal direction interpolation circuit which performs a horizontal direction interpolation to the input digital image; a horizontal direction interpolation output buffer which stores the pixel values of the input digital image that are interpolated in the horizontal direction interpolation circuit; and vertical direction interpolation circuit which performs a vertical direction interpolation to the input digital image.
 12. The apparatus of claim 11, wherein the controller selects the coefficient equation according to the interpolation interval among stored coefficient equations in the register for each coefficient in the interpolation node calculation equation.
 13. The apparatus of claim 12, wherein the coefficient equation is stored in the register and has linearity so as to reduce a processing time of the digital image and prevent errors in the interpolated digital image.
 14. The apparatus of claim 1, wherein the coefficient equation and errors of the coefficient equation have linearity so as to reduce a number of adders and multipliers, where the coefficient equation is embodied in a form of hardware.
 15. The apparatus of claim 1, wherein the register is stored in the controller.
 16. The apparatus of claim 3, wherein the coefficient equation is stored in the register and has linearity so as to reduce a processing time of the digital image and prevent errors in the interpolated digital image.
 17. A computer readable medium encoded with operating instructions for implementing a method of processing a digital image by a computer, the method comprising: measuring an interpolation interval of pixel values of the input digital image; calculating a coefficient by substituting the interpolation interval for a coefficient equation stored in a register data set; calculating an interpolation node for the digital image by substituting the coefficient and an output pixel position value of the digital image for an interpolation node calculation equation; and controlling an interpolation processing unit to interpolate the digital image to the interpolation node.
 18. The computer readable medium of claim 17, wherein the measuring of the interpolation interval comprises: calculating a size ratio of the pixel values of the input digital image to aimed pixel values; measuring positions of sampled output pixels of the input digital image; and obtaining the interpolation interval according to the size ratio and the positions of the sampled output pixels.
 19. The computer readable medium of claim 17, further comprising selecting the coefficient equation according to the interpolation interval among stored coefficient equations in the register data set for each coefficient in the interpolation node calculation equation.
 20. The computer readable medium of claim 17, wherein the coefficient equation satisfies the following relationship: C _(n)(t)=a _(kn) t+b _(kn) where C_(n) denotes the coefficient of a variable of a position of an output pixel indicating an n-th input digital image in an equation representing the position of the output pixel which is the interpolation node, t denotes the interpolation interval, a_(kn) is stored in a k-th register and represents a gradient of a straight line passing a position of an output pixel of an n-1th input digital image and the position of the output pixel of the n-th input digital image with respect to a predetermined interpolation interval, b_(kn) is stored in the k-th register and represents an intersecting point between the straight line passing the position of the output pixel of the n-1th input digital image and the position of the output pixel of the n-th input digital image with respect to the predetermined interpolation interval and Y axis, and ‘k=1, 2, 3, . . . , k, . . . ’ and ‘n=2, 3, 4, . . . , n, . . . .’
 21. The computer readable medium of claim 20, wherein the interpolation node calculation equation satisfies the following relationship: Y _(p) =Y _(n−1) C _(n−1) Y _(n) C _(n) +Y _(n+1) C _(n+1) Y _(n+2) C _(n+2) where Y_(p) denotes the interpolation node of the input digital image, Y_(n) denotes a position of an n-th sampled output pixel of the input digital image, and C_(n) is he coefficient of the position of the n-th sampled output pixel of the input digital image. 